Strong Normalization from Weak Normalization in Typedλ-Calculi
نویسندگان
چکیده
منابع مشابه
On strong normalization of explicit substitution calculi
We present a counterexample to the strong normalization—also called termination—of the underlying calculus of explicit substitution of λτ . This problem was open.
متن کاملStrong normalization for applied lambda calculi
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting ⊥ is strongly normalising provided all its ‘stratified approximations’ are. From this we derive a general normalisation theorem for applied typed λ-calculi: If all constants have a total value, then all typeable terms are strongly nor...
متن کاملUniform Strong Normalization for Multi-Discipline Calculi
Modern programming languages have effects and mix multiple calling conventions, and their core calculi should too. We characterize calling conventions by their “substitution discipline” that says what variables stand for, and design calculi for mixing disciplines in a single program. Building on variations of the reducibility candidates method, including biorthogonality and symmetric candidates...
متن کاملA semantic method to prove strong normalization from weak normalization (draft)
1 Minimal deduction modulo 1.1 Syntax We consider a set (T) of sorts, an infinite set of variables of each sort, a set (f) of function symbols, and a set (P) of predicate symbols, that come with their rank. The formation rules for objects and propositions are the usual ones. – Variables of sort T are terms of sort T. Propositions are built-up from atomic propositions with the usual connective ⇒...
متن کامل-calculi with Explicit Substitutions and Weak Composition Which Preserve -strong Normalization
This paper studies preservation of-strong normalization by two diierent connuent-calculi with explicit substitutions deened in Kes96]; the particularity of these calculi, called d and dn respectively, is that both have a (weak) composition operator for substitutions. We develop an abstract simulation technique allowing to reduce preservation of-strong normalization of one calculus to that of an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1997
ISSN: 0890-5401
DOI: 10.1006/inco.1996.2622